Programming Unconventional Computers: Dynamics, Development, Self-Reference
نویسندگان
چکیده
منابع مشابه
Programming Unconventional Computers: Dynamics, Development, Self-Reference
Classical computing has well-established formalisms for specifying, refining, composing, proving, and otherwise reasoning about computations. These formalisms have matured over the past 70 years or so. Unconventional Computing includes the use of novel kinds of substrates–from black holes and quantum effects, through to chemicals, biomolecules, even slime moulds–to perform computations that do ...
متن کاملUnconventional Programming
ions for Directing Self-Organising Patterns . . . . . . . . . . . . . . . . . . . . 70Daniel Coore Abstractions for Code Reuse in ECOLI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79Dean D. Holnessions for Code Reuse in ECOLI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79Dean D. Holness Programming an Amorphous Computational Medium . . . . . . . . . ....
متن کاملUnconventional Computer Programming
Classical computing has well-established formalisms forspecifying, refining, composing, proving, and otherwise reasoningabout computations. These formalisms have matured over the past70 years or so.Unconventional Computing includes the use novel kinds of sub-strates – from black holes and quantum effects, through to chem-icals, biomolecules, even slime moulds – to perfor...
متن کاملProgramming Pulse Driven Quantum Computers
Arrays of weakly–coupled quantum systems can be made to compute by subjecting them to a sequence of electromagnetic pulses of well–defined frequency and length. Such pulsed arrays are true quantum computers: bits can be placed in superpositions of 0 and 1, logical operations take place coherently, and dissipation is required only for error correction. Programming such computers is accomplished ...
متن کاملGenetic Programming for Quantum Computers
Genetic programming can be used to automatically discover algorithms for quantum computers that are more efficient than any classical computer algorithms for the same problems. In this paper we exhibit the first evolved betterthan-classical quantum algorithm, for Deutsch’s “early promise” problem. We also demonstrate a technique for evolving scalable quantum gate arrays and discuss other issues...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2012
ISSN: 1099-4300
DOI: 10.3390/e14101939